One of the well-known combinatorial optimization problems is travelling salesman problem (TSP). This problem is in the fields of\r\nlogistics, transportation, and distribution. TSP is among the NP-hard problems, andmany differentmetaheuristics are used to solve\r\nthis problem in an acceptable time especially when the number of cities is high. In this paper, a new meta-heuristic is proposed to\r\nsolve TSP which is based on new insight into network routing problems.
Loading....